Load Balancing by Redundant Decomposition and Mapping

نویسندگان

  • Jan F. de Ronde
  • Arjen Schoneveld
  • Peter M. A. Sloot
  • Nick Floros
  • Jeffrey S. Reeve
چکیده

In this paper a new methodology for load balancing parallel processes on parallel systems is proposed. The problem of load balancing is considered to be an NP-hard optimization task. Taking static parallel tinite element applications as a case study, the benefits and losses that follow from applying the methodology are studied. It is found that the proposed methodology can be especially useful for load balancing in asymmetric processor topologies, and therefore is of importance for work load balancing in workstation clusters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Load Balancing by Domain Decomposition: the Bounded Neighbors Approach

This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain returned by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an al...

متن کامل

Load Balancing by Domain Decomposition: the Bounded Neighbors Approach

This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain returned by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an al...

متن کامل

Branch and Bound Based Load Balancing for Parallel Applications

Many parallel applications are highly dynamic in nature. In some, computation and communication patterns change gradually during the run; in others those characteristics change abruptly. Such dynamic applications require an adaptive load balancing strategy. We are exploring an adaptive approach based on multi-partition object-based decomposition, supported by object migration. For many applicat...

متن کامل

Load Balancing Approaches for Web Servers: A Survey of Recent Trends

Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...

متن کامل

Parallel Multigrid in an Adaptive PDE Solver Based on Hashing

Partial diierential equations can be solved eeciently by adaptive multigrid methods on a parallel computer. We report on the concept of hash-table storage techniques to set up such a code. The code requires substantial less amount of memory and is easier to code in the sequential case. The parallelization takes place by a space lling curve domain decomposition intimately connected to the hash t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Future Generation Comp. Syst.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1996